Lazy Learning for Classification Based on Query Projections
نویسندگان
چکیده
We propose a novel lazy learning method called QPAL. QPAL does not simply utilize a kind of distance measure between the query instance and training instances as many lazy learning methods do. It attempts to discover useful patterns known as query projections, which are customized to the query instance. The discovery for useful QPs is conducted in an innovative way. QPAL can guarantee to discover high-quality QPs in the learning process. We use some benchmark data sets and a spam email filtering problem to evaluate QPAL and demonstrate that QPAL achieves good performance and high reliability.
منابع مشابه
A lazy learning approach for building classification models
In this paper we propose a lazy learning strategy for building classification learning models. Instead of learning the models with the whole training data set before observing the new instance, a selection of patterns is made depending on the new query received and a classification model is learnt with those selected patterns. The selection of patterns is not homogeneous, in the sense that the ...
متن کاملA semi-supervised Spam mail detector
This document describes a novel semi-supervised approach to spam classification, which was successful at the ECML/PKDD 2006 spam classification challenge. A local learning method based on lazy projections was successfully combined with a variant of a standard semisupervised learning algorithm.
متن کاملAd Hoc Attribute-Value Prediction
The evolving ease and efficiency in accessing large amounts of data presents an opportunity to execute prediction tasks based on this data (Hunt, Marin, & Stone 1964). Research in learning-from-example has addressed this opportunity with algorithms that induce either decision structures (ID3) or classification rules (AQ15). Lazy learning research on the other hand, delay the model construction ...
متن کاملMemory-Based Methods for Regression and Classification
Memory-based learning methods operate by storing all (or most) of the training data and deferring analysis of that data until "run time" (i.e., when a query is presented and a decision or prediction must be made). When a query is received, these methods generally answer the query by retrieving and analyzing a small subset of the training data-namely, data in the immediate neighborhood of the qu...
متن کاملLazy Learning Meets the Recursive Least Squares Algorithm
Lazy learning is a memory-based technique that, once a query is received, extracts a prediction interpolating locally the neighboring examples of the query which are considered relevant according to a distance measure. In this paper we propose a data-driven method to select on a query-by-query basis the optimal number of neighbors to be considered for each prediction. As an efficient way to ide...
متن کامل